On Structure of Some Plane Graphs with Application to Choosability
نویسندگان
چکیده
منابع مشابه
On Structure of Some Plane Graphs with Application to Choosability
A graph G=(V, E) is (x, y)-choosable for integers x> y 1 if for any given family [A(v) | v # V] of sets A(v) of cardinality x, there exists a collection [B(v) | v # V] of subsets B(v)/A(v) of cardinality y such that B(u) & B(v)=< whenever uv # E(G). In this paper, structures of some plane graphs, including plane graphs with minimum degree 4, are studied. Using these results, we may show that if...
متن کاملOn structure of graphs embedded on surfaces of nonnegative characteristic with application to choosability
In this paper, we prove a structural theorem of Lebesgue’s type concerning some unavoidable con1gurations for graphs which can be embedded on surfaces of nonnegative characteristic and in which no two 3-cycles share a common vertex. As a corollary, we get a result about choosability of graphs embedded in surface of positive characteristic. c © 2002 Elsevier Science B.V. All rights reserved.
متن کاملThe edge-face choosability of plane graphs
A plane graph G is said to be k-edge-face choosable if, for every list L of colors satisfying |L(x)| = k for every edge and face x , there exists a coloring which assigns to each edge and each face a color from its list so that any adjacent or incident elements receive different colors. We prove that every plane graph G with maximum degree ∆(G) is (∆(G)+ 3)-edge-face choosable. © 2004 Elsevier ...
متن کاملThe 3-choosability of plane graphs of girth 4
A set S of vertices of the graph G is called k-reducible if the following is true: G is k-choosable if and only if G − S is k-choosable. A k-reduced subgraph H of G is a subgraph of G such that H contains no k-reducible set of some specific forms. In this paper, we show that a 3-reduced subgraph of a non-3-choosable plane graph G contains either adjacent 5-faces, or an adjacent 4-face and kface...
متن کاملk-forested choosability of graphs with bounded maximum average degree
A proper vertex coloring of a simple graph is $k$-forested if the graph induced by the vertices of any two color classes is a forest with maximum degree less than $k$. A graph is $k$-forested $q$-choosable if for a given list of $q$ colors associated with each vertex $v$, there exists a $k$-forested coloring of $G$ such that each vertex receives a color from its own list. In this paper, we prov...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 2001
ISSN: 0095-8956
DOI: 10.1006/jctb.2001.2038